The Ramsey numbers for Stars of odd Order versus a Wheel of Order nine

نویسندگان

  • Yunqing Zhang
  • T. C. Edwin Cheng
  • Yaojun Chen
چکیده

For two given graphs G1 and G2, the Ramsey number R(G1,G2) is the smallest positive integer n such that for any graph G of order n, either G contains G1 or the complement of G contains G2. Let Sn denote a star of order n and Wm a wheel of order m + 1. In this paper, we show that R(Sn,W8) = 2n + 2 for n ≥ 6 and n ≡ 0 (mod 2). c © 2007 Elsevier Ltd. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Ramsey numbers of large trees versus wheels

For two given graphs G1 and G2, the Ramseynumber R(G1,G2) is the smallest integer n such that for anygraph G of order n, either $G$ contains G1 or the complementof G contains G2. Let Tn denote a tree of order n andWm a wheel of order m+1. To the best of our knowledge, only R(Tn,Wm) with small wheels are known.In this paper, we show that R(Tn,Wm)=3n-2 for odd m with n>756m^{10}.

متن کامل

The Ramsey Numbers for Disjoint Union of Stars

The Ramsey number for a graph G versus a graph H, denoted by R(G,H), is the smallest positive integer n such that for any graph F of order n, either F contains G as a subgraph or F contains H as a subgraph. In this paper, we investigate the Ramsey numbers for union of stars versus small cycle and small wheel. We show that if ni ≥ 3 for i = 1, 2, . . . , k and ni ≥ ni+1 ≥ √ ni − 2, then R( ∪k i=...

متن کامل

The Ramsey numbers of stars versus wheels

For two given graphs G1 and G2, the Ramsey number R(G1,G2) is the smallest positive integer n such that for any graph G of order n, either G contains G1 or the complement of G contains G2. Let Sn denote a star of order n and Wm a wheel of order m+1. This paper shows that R(Sn, W6) = 2n+1 for n ≥ 3 and R(Sn, Wm ) = 3n − 2 for m odd and n ≥ m − 1 ≥ 2. © 2003 Elsevier Ltd. All rights reserved.

متن کامل

Three Results on Cycle-Wheel Ramsey Numbers

Given twographsG1 andG2, theRamseynumber R(G1,G2) is the smallest integer N such that, for any graph G of order N , either G1 is a subgraph of G, or G2 is a subgraph of the complement of G. We consider the case that G1 is a cycle and G2 is a (generalized) wheel. We expand the knowledge on exact values of Ramsey numbers in three directions: large cycles versus wheels of odd order; large wheels v...

متن کامل

Ramsey numbers of stars versus wheels of similar sizes

We study the Ramsey number R(Wm, Sn) for a star Sn on n vertices and a wheel Wm on m + 1 vertices. We show that the Ramsey number R(Wm, Sn)= 3n− 2 for n=m,m+ 1, and m+ 2, where m 7 and odd. In addition, we give the following lower bound for R(Wm, Sn) where m is even: R(Wm, Sn) 2n+ 1 for all n m 6. © 2004 Elsevier B.V. All rights reserved.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Eur. J. Comb.

دوره 29  شماره 

صفحات  -

تاریخ انتشار 2008